Fundamental groupoids of k-graphs
نویسندگان
چکیده
k-graphs are higher-rank analogues of directed graphs which were first developed to provide combinatorial models for operator algebras of Cuntz– Krieger type. Here we develop a theory of the fundamental groupoid of a kgraph, and relate it to the fundamental groupoid of an associated graph called the 1-skeleton. We also explore the failure, in general, of k-graphs to faithfully embed into their fundamental groupoids.
منابع مشابه
J an 2 00 4 FUNDAMENTAL GROUPOIDS OF k - GRAPHS
k-graphs are higher-rank analogues of directed graphs which were first developed to provide combinatorial models for operator algebras of CuntzKrieger type. Here we develop a theory of the fundamental groupoid of a kgraph, and relate it to the fundamental groupoid of an associated graph called the 1-skeleton. We also explore the failure, in general, of k-graphs to faithfully embed into their fu...
متن کاملFundamental groupoids of digraphs and graphs
In this paper we introduce the notion of fundamental groupoid of a digraph and prove its basic properties. In particular, we obtain a product theorem and an analog of the Van Kampen theorem. Considering the category of (undirected) graphs as the full subcategory of digraphs we transfer the results to the category of graphs. As a corollary we obtain the corresponding results for the fundamental ...
متن کاملSums over Graphs and Integration over Discrete Groupoids
We show that sums over graphs such as appear in the theory of Feynman diagrams can be seen as integrals over discrete groupoids. From this point of view, basic combinatorial formulas of the theory of Feynman diagrams can be interpreted as pull-back or push-forward formulas for integrals over suitable groupoids.
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملFinite Groupoids, Finite Coverings and Symmetries in Finite Structures
We propose a novel construction of finite hypergraphs and relational structures that is based on reduced products with Cayley graphs of groupoids. To this end we construct groupoids whose Cayley graphs have large girth not just in the usual sense, but with respect to a discounted distance measure that contracts arbitrarily long sequences of edges within the same sub-groupoid (coset) and only co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003